min-max search

См. также в других словарях:

• Max Karl Ernst Ludwig Planck — Max Planck Max Karl Ernst Ludwig Planck (* 23. April 1858 in Kiel; † 4. Oktober 1947 in Göttingen) war ein bedeutender deutscher Physiker und Nobelpreisträger. Er wird als Begründer der Quantenphysik betrachtet …   Deutsch Wikipedia

• Max Gradel — Gradel as a Leicester City player. Personal information Full name …   Wikipedia

• Max-min fairness — In communication networks and multiplexing, a division of the bandwidth resources is said to be max min fair when: firstly, the minimum data rate that a dataflow achieves is maximized; secondly, the second lowest data rate that a dataflow… …   Wikipedia

• MC The Max — M.C the MAX (Moon Child the MAX) is a Korean rock band. They debuted in 2000 as a 4 member band under the name Moon Child . Their 1st album consisted of mainly techno songs, with a few rock songs. Their 2nd album had a more similar sound to what… …   Wikipedia

• Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… …   Wikipedia

• Guided Local Search — is a metaheuristic search method. A meta heuristic method is a method that sits on top of a local search algorithm to change its behaviour. Guided Local Search builds up penalties during a search. It uses penalties to help local search algorithms …   Wikipedia

• In Search of Santa — Infobox Film name=In Search of Santa caption= In Search of Santa DVD cover director=William R. Kowalchuk writer=Michael Aschner starring=Hilary Duff Haylie Duff producer=William R. Kowalchuk Louis Sek distributor=Miramax Family Films (US)… …   Wikipedia

• Six Charlies in Search of An Author — is an episode of the classic radio comedy, The Goon Show. It was first broadcast on 26th December 1956.The title is a parody of the play Six Characters in Search of an Author, by Luigi Pirandello. While the plot revolves around the common… …   Wikipedia

• Thomas Anantharaman — Thomas S. Anantharaman is a computer statistician specializing in Bayesian inference approaches for NP complete problems. He is best known for his work with Feng hsiung Hsu from 1985 1990 on the Chess playing computers ChipTest and Deep Thought… …   Wikipedia

• Heap (data structure) — This article is about the programming data structure. For the dynamic memory area, see Dynamic memory allocation. Example of a complete binary max heap In computer science, a heap is a specialized tree based data structure that satisfies the heap …   Wikipedia

• Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… …   Wikipedia